Improved answer-set programming encodings for abstract argumentation
نویسندگان
چکیده
The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks. 1TU Dresden. E-mail: {sarah.gaggl,norbert.manthey}@tu-dresden.de 2La Sapienza, Rome. Email: [email protected] 3University of Helsinki. Email: [email protected] 4TU Wien. E-mail: [email protected] Acknowledgements: This work has been funded by the Austrian Science Fund (FWF) through projects Y698 and I1102, by the German Research Foundation (DFG) through project HO 1294/11-1, and by Academy of Finland through grants 251170 COIN and 284591. Copyright c © 2015 by the authors
منابع مشابه
Abstract Argumentation and Answer-Set Programming
Argumentation and Answer-Set Programming Sarah Alice Gaggl, Stefan Woltran Vienna University of Technology, Austria Abstract. In this article, we overview encodings for problems associated to abstract argumentation frameworks (AFs) in the language of Answer-Set Programming (ASP). Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to pr...
متن کاملMaking Use of Advances in Answer-Set Programming for Abstract Argumentation Systems
Dung’s famous abstract argumentation frameworks represent the core formalism for many problems and applications in the field of argumentation which significantly evolved within the last decade. Recent work in the field has thus focused on implementations for these frameworks, whereby one of the main approaches is to use Answer-Set Programming (ASP). While some of the argumentation semantics can...
متن کاملReduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks
This paper reconsiders Modgil’s Extended Argumentation Frameworks (EAFs) that extend Dung’s abstract argumentation frameworks by attacks on attacks. This allows to encode preferences directly in the framework and thus also to reason about the preferences themselves. As a first step to reduction-based approaches to implement EAFs, we give an alternative (but equivalent) characterization of accep...
متن کاملDIAMOND : A System for Computing with
This paper briefly describes the DIAMOND system, version 2.0.0, in its role as submission to the First International Competition on Computational Models of Argumentation (ICCMA). DIAMOND is essentially a collection of answer set programming (ASP) encodings of semantics of abstract dialectical frameworks (ADFs) together with a wrapper script that calls an ASP solver with adequate encodings for a...
متن کاملAnswer-set programming encodings for argumentation frameworks
We present reductions from Dung’s argumentation framework (AF) and generalizations thereof to logic programs under the answer-set semantics. The reduction is based on a fixed disjunctive datalog program (the interpreter) and its input which is the only part depending on the AF to process. We discuss the reductions, which are the basis for the system ASPARTIX in detail and show their adequacy in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 15 شماره
صفحات -
تاریخ انتشار 2015